Faster algorithm for optimum Steiner trees
نویسنده
چکیده
We present a new deterministic algorithm for the Steiner tree problem in weighted graphs. Its running time is O(nk2k+log2 k log2 n), where n is the number of vertices and k is the number of terminals. This is faster than all previously known algorithms if 2 log n(log log n)3 < k < (n − log n)/2. Our algorithm is based on a new tree composition theorem.
منابع مشابه
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees
An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.
متن کاملOptimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time
This paper presents an algorithm that computes an optimal rectilinear Steiner minimal tree of n points in at most O(n 2 2:62 n) time. For instances small enough to solve in practice, this time bound is provably faster than any previous algorithm, and improves the previous best bound for practically solvable instances, which is O(n3 n). Experimental evidence is also presented that demonstrates t...
متن کاملA Hybrid Algorithm for Solving Steiner Tree Problem
In this paper, a hybrid algorithm based on modified intelligent water drops algorithm and learning automata for solving Steiner tree problem is proposed. Since the Steiner tree problem is NP-hard, the aim of this paper is to design an algorithm to construct high quality Steiner trees in a short time which are suitable for real time multicast routing in networks. The global search and fast conve...
متن کاملThe cavity approach for Steiner trees Packing problems
The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the Max-Sum algorithm. In particular, recent developments to solve the Edge-Disjoint paths problem and the Prize collecting Steiner tree Problem on graphs have shown remarkable results for several classes of graphs and for bench...
متن کاملA Heuristic Algorithm for Solving Steiner Tree Problem on the Graph
Steiner tree problem on the graph is an NPComplete problem and has no exact solution in polynomial time. Since this problem is practically useful, there are more attentions to heuristic and approximation approaches rather than exact ones. By using heuristic algorithms, the near optimum answers are obtained in polynomial time that this is faster than exact approaches. The goal of Steiner Tree pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 111 شماره
صفحات -
تاریخ انتشار 2011